منابع مشابه
Mod–discrete Expansions
In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the n’th random variable Xn is by a particular member Rn of a given family of distributions, whose variance increases with n. The basic assumption is that the ratio ...
متن کاملMatrix expansions for computing the discrete hartley transform for blocklength N ≡ 0 (mod 4)
Abstract— A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorithm presents a better performance, in terms of multiplicative complexity, than previously known fast Hartley transform algorithms and same performance, in terms of additive complexity, than Split-Radix algorithm. A detailed descriptio...
متن کاملAn exposé on discrete Wiener chaos expansions
In this note we review and compare different versions of expansions in discrete Wiener chaos. We relate these expansions to the Rota-Wallstrom combinatorial approach to stochastic integration and to extended Haar systems. At the end we present some simple applications. 1 Preliminaries Discrete stochastic calculus has seen a revival during the last decade or so, and several lines of work have be...
متن کاملOn Dimension Invariance of Discrete Gabor Expansions
We reveal a dimension invariance property of the (discrete) Gabor expansion (DGE). This is an important and very useful result in applications where signal dimension is large, or signals are on-going with infinite length. As a consequence of this result, a DGE scheme developed in a given (relatively small) dimension may be applied in spaces of arbitrary large dimension by simply adjusting the n...
متن کاملDiscrete Ramanujan-Fourier Transform of Even Functions (mod $r$)
An arithmetical function f is said to be even (mod r) if f (n) = f ((n, r)) for all n ∈ Z + , where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even function (mod r) can be written in terms of Ramanujan's sum and may thus be referred to as the Discrete Ramanujan-Fourier Transform.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2013
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-013-0498-8